Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems
نویسندگان
چکیده
Constraint satisfaction has become ubiquitous in the modern world, able to model and offer solution techniques for many of the most pressing problems. However, no matter how good the techniques become, some problems just do not have a satisfiable solution, and are referred to as inconsistent. Yet even when such problems are considered, one is still interested in finding the minimal subset of constraints causing the issue. Removing such constraints restores consistency. In the context of Boolean formulas, this minimal number of troublesome constraints is referred to as Minimal Correction Subsets (MCSs). More formally, an MCS can be defined as follows:
منابع مشابه
A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems
Even when it has been shown that no solution exists for a particular constraint satisfaction problem, one may still aim to restore consistency by relaxing the minimal number of constraints. In the context of a Boolean formula like SAT, such a relaxation is referred to as a Minimal Correction Subset (MCS). In the context of SAT, identifying MCSs for an instance is relevant in a wide range of app...
متن کاملComputing Minimal Sets on Propositional Formulae I: Problems & Reductions
Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of SAT involve solving function as opposed to decision problems. Concrete examples include computing minimal unsatisfiable subsets, minimal correction subsets, pr...
متن کاملOn Computing Minimal Correction Subsets
A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal relaxations and minimal explanations for over-constrained problems find many practical uses. For Boolean formulas, minimal relaxations of over-constrained problems are referred to as Minimal Correction Subsets (MCSes). MCSes find many applications, including the enumeration of MUSes. Existing approaches fo...
متن کاملMaximal Falsifiability - Definitions, Algorithms, and Applications
Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years, both problems have been studied in terms of exact and approximation algorithms. In addition, the MaxSAT problem has been characterized in terms of Maximal Satisfiable Subsets (MSSes) and Minimal Correction Subsets (MCSe...
متن کاملMinimal Sets over Monotone Predicates in Boolean Formulae
The importance and impact of the Boolean satisfiability (SAT) problem in many practical settings is well-known. Besides SAT, a number of computational problems related with Boolean formulas find a wide range of practical applications. Concrete examples for CNF formulas include computing prime implicates (PIs), minimal models (MMs), minimal unsatisfiable subsets (MUSes), minimal equivalent subse...
متن کامل